POLYNOMIAL ALGORITHMS FOR PROJECTING A POINT ONTO A REGION DEFINED BY A LINEAR CONSTRAINT AND BOX CONSTRAINTS IN Rn
نویسنده
چکیده
We consider the problem of projecting a point onto a region defined by a linear equality or inequality constraint and two-sided bounds on the variables. Such problems are interesting because they arise in various practical problems and as subproblems of gradient-type methods for constrained optimization. Polynomial algorithms are proposed for solving these problems and their convergence is proved. Some examples and results of numerical experiments are presented.
منابع مشابه
An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint
We consider the problem of minimizing a convex separable logarithmic function over a region defined by a convex inequality constraint or linear equality constraint, and twosided bounds on the variables (box constraints). Such problems are interesting from both theoretical and practical point of view because they arise in somemathematical programming problems as well as in various practical prob...
متن کاملMinimization of a Convex Linear-Fractional Separable Function Subject to a Convex Inequality Constraint or Linear Inequality Constraint and Bounds on the Variables
We consider the problem of minimizing a convex linear-fractional separable function over a feasible region defined by a convex inequality constraint or linear inequality constraint, and bounds on the variables (box constraints). These problems are interesting from both theoretical and practical points of view because they arise in somemathematical programming problems and in various practical p...
متن کاملMinimization of a strictly convex separable function subject to a convex inequality constraint or linear equality constraints and bounds on the variables
In this paper, we consider the problem of minimizing a strictly convex separable function over a feasible region defined by a convex inequality constraint and two-sided bounds on the variables (box constraints). Also, the convex separable program with a strictly convex objective function subject to linear equality constraints and bounded variables is considered. These problems are interesting f...
متن کاملNumerical method for solving optimal control problem of the linear differential systems with inequality constraints
In this paper, an efficient method for solving optimal control problems of the linear differential systems with inequality constraint is proposed. By using new adjustment of hat basis functions and their operational matrices of integration, optimal control problem is reduced to an optimization problem. Also, the error analysis of the proposed method is nvestigated and it is proved that the orde...
متن کاملOptimal Trajectory Planning of a Box Transporter Mobile Robot
This paper aims to discuss the requirements of safe and smooth trajectory planning of transporter mobile robots to perform non-prehensile object manipulation task. In non-prehensile approach, the robot and the object must keep their grasp-less contact during manipulation task. To this end, dynamic grasp concept is employed for a box manipulation task and corresponding conditions are obtained an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004